Mixing Planning and Scheduling to Model Complex Process Environments
نویسنده
چکیده
In most current APS (Advanced Planning and Scheduling) systems the planning and scheduling tasks are handled separately using different methods and technology from the areas like Artificial Intelligence and Operations Research. Recently, Constraint Programming becomes a roof over several solving technologies that allow us to solve both planning and scheduling tasks within single declarative framework. In the paper, we suggest mixing planning and scheduling tasks within single system that is capable to solve more complicated scheduling problems in complex process environments. We analyse different views of planning and scheduling, identify the similarities and the differences of both tasks and we propose a general structure of scheduler with some planning capabilities. In the second part of the paper, we compare various modelling approaches from the mixed planning and scheduling point of view. We concentrate on capabilities of the models to capture typical problems in complex process environments primarily but the conclusions are applicable to other (non-process) problem areas. The presented results make the basics of a generic scheduling engine that is currently implemented within the VisOpt project.
منابع مشابه
Towards Mixed Planning and Scheduling
The conventional wisdom and practice is that planning and scheduling tasks are solved separately using different methods and approaches. However, recent development in industrial planning and scheduling demands for mixing both tasks to allow modelling of wider class of problems. The purpose of this paper is to present a framework for mixing planning and scheduling tasks within single system. We...
متن کاملExact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...
متن کاملA Mathematical Model for Operating Room Scheduling Considering Limitations on Human Resources Access and Patient Prioritization
Operating room scheduling is an important task in healthcare sector. This study proposes a Mixed Integer Nonlinear Programming (MINLP) mathematical model for the scheduling of the operating rooms. In the presented model, apart from scheduling the patients’ surgery process, shifting of the medical staff is also carried out. The innovation considered in the proposed model is aimed at prioritizing...
متن کاملDynamic Constraint Models for Complex Production Environments
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and scheduling problems are usually solved independently using different methods. Recent development of Constraint Programming brings a new breeze to these areas. It allows using the same techniques for modelling planning an...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000